#include <iostream>
using namespace std;

const int N = 10;
int path[N],st[N];
int n;

void dfs(int u)
{
    if(u == n)
    {
        for(int i = 0 ; i < n ; ++i) printf("%5d",path[i]);
        printf("\n");
        return;
    }
    for(int i = 1 ; i <= n ; ++i)
    {
        if(!st[i])
        {
            path[u] = i;
            st[i] = 1;
            dfs(u+1);
            st[i] = 0;
        }
    }
}

int main()
{
    cin >> n;
    dfs(0);
    return 0;
}